Graphon particle system: Uniform-in-time concentration bounds
نویسندگان
چکیده
In this paper, we consider graphon particle systems with heterogeneous mean-field type interactions and the associated finite approximations. Under suitable growth (resp. convexity) assumptions, obtain uniform-in-time concentration estimates, over infinite) time horizon, for Wasserstein distance between empirical measure its limit, extending work of Bolley–Guillin–Villani (2007).
منابع مشابه
Barbosa, Uniform Polynomial Time Bounds, and Promises
This note is a commentary on, and critique of, André Luiz Barbosa’s paper entitled “P != NP Proof.” Despite its provocative title, what the paper is seeking to do is not to prove P 6= NP in the standard sense in which that notation is used in the literature. Rather, Barbosa is (and is aware that he is) arguing that a different meaning should be associated with the notation P 6= NP, and he claim...
متن کاملGraphon games
The study of strategic behavior in large scale networks via standard game theoretical methods is a challenging, if not intractable, task. In this paper, we propose a way to approximate games played over networks of increasing size, by using the graph limiting concept of graphon. To this end, we introduce the new class of graphon games for populations of infinite size. We investigate existence a...
متن کاملUniform bounds and exponential time decay results for the Vlasov-Poisson-Fokker-Planck system
We consider the non-linear VPFP system with a coulombian repulsive interaction potential and a generic confining potential in space dimension d ≥ 3. Using spectral and kinetic methods we prove the existence and uniqueness of a mild solution with bounds uniform in time in weighted spaces, and for small total charge we find an explicit exponential rate of convergence toward the equilibrium in ter...
متن کاملUniversal Automata with Uniform Bounds on Simulation Time
the re is no uniform bound on the loss of time incurred when some universal automaton globally simulates another automaton. More precisely, define an automaton to be a partial recursive function with decidable domain. Say that an automaton U locally simulates an automaton f via recursive, injective encoding cr with recursive time bound b iff for all z, z ' C IN the following holds: f ( z ) = z'...
متن کامل9 Uniform Time Average Consistency of Monte Carlo Particle Filters
We prove that bootstrap type Monte Carlo particle filters approximate the optimal nonlinear filter in a time average sense uniformly with respect to the time horizon when the signal is ergodic and the particle system satisfies a tightness property. The latter is satisfied without further assumptions when the signal state space is compact, as well as in the noncompact setting when the signal is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2023
ISSN: ['1879-209X', '0304-4149']
DOI: https://doi.org/10.1016/j.spa.2022.11.008